home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
ftp.cs.arizona.edu
/
ftp.cs.arizona.edu.tar
/
ftp.cs.arizona.edu
/
icon
/
newsgrp
/
group99a.txt
/
000121_icon-group-sender _Thu Jun 3 16:45:03 1999.msg
< prev
next >
Wrap
Internet Message Format
|
2000-09-20
|
1KB
Return-Path: <icon-group-sender>
Received: (from root@localhost)
by baskerville.CS.Arizona.EDU (8.9.1a/8.9.1) id QAA28313
for icon-group-addresses; Thu, 3 Jun 1999 16:43:49 -0700 (MST)
Message-Id: <199906032343.QAA28313@baskerville.CS.Arizona.EDU>
Delivered-To: icon-group@silliac.cs.arizona.edu
Date: Thu, 03 Jun 1999 16:59:34 -0500
From: de yang <deyang@lucent.com>
To: icon-group@optima.CS.Arizona.EDU
Subject: Find the longest matching substrings
Errors-To: icon-group-errors@optima.CS.Arizona.EDU
Status: RO
Dear Sirs,
I am working on a project that will mark the inserted or deleted phases
between two strings. I am wondering whether you know any library
procedure that will anchor ( or report ) the longest phases that exists
in both strings.
For example, assume that we have two strings:
old:="other strings ab cd e and more substrings"
new:="some more substrings ab cd ab cd e"
This function should return phases and position in both strings, i.e.
[15, 28, "ab cd e"] for "ab cd e" is the longest phase that matched (
it has three continuous matching elements ).
Thanks,
De Yang
Lucent Technologies Inc.
deyang@lucent.com